On binary linear completely regular and completely transitive codes with arbitrary covering radius
نویسنده
چکیده
An infinite class of binary linear completely regular and completely transitive codes is given. The covering radius of these codes is growing with the length of the code.
منابع مشابه
On a family of binary completely transitive codes with growing covering radius
A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes with d = 3, covering radius ρ and length ( 4 ρ 2 )
متن کاملA family of binary completely transitive codes and distance-transitive graphs
In this paper we construct new family of binary linear completely transitive (and, therefore, completely regular) codes. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes in the constructed class of codes with d = 3, covering radius ρ and length ( 4 ρ 2 ) and ( 4 ρ+2 2 ) , respectively. These new completely tra...
متن کاملOn nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
متن کاملFamilies of completely transitive codes and distance transitive graphs
In a previous work, the authors found new families of linear binary completely regular codes with the covering radius ρ = 3 and ρ = 4. In this paper, the automorphism groups of such codes are computed and it is proven that the codes are not only completely regular, but also completely transitive. From these completely transitive codes, in the usual way, i.e., as coset graphs, new presentations ...
متن کاملOn linear completely regular codes with covering radius rho=1. Construction and classification
Completely regular codes with covering radius ρ = 1 must have minimum distance d ≤ 3. For d = 3, such codes are perfect and their parameters are well known. In this paper, the cases d = 1 and d = 2 are studied and completely characterized when the codes are linear. Moreover, it is proven that all these codes are completely transitive.
متن کامل